Some Problems Related to Keys and the Boyce-Codd Normal Form
نویسندگان
چکیده
The aim of this paper is to investigate the connections between minimal keys and antikeys for special Sperner-systems by hypergraphs. The BoyceCodd normal form and some related problems are also studied in this paper.
منابع مشابه
Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a r t i c l e i n f o a b s t r a c t The theory of functional dependencies is based on relations, i.e. sets of tuples. Over...
متن کاملExtending Existing Dependency Theory to Temporal Databases
Normal forms play a central role in the design of relational databases. Several normal forms for temporal relational databases have been proposed. These definitions are particular to specific temporal data models, which are numerous and incompatible. This paper attempts to rectify this situation. We define a consistent framework of temporal equivalents of the important conventional database des...
متن کاملThe Boyce-Codd-Heath Normal Form for SQL
In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd normal form, guarantees the elimination of data redundancy in terms of functional dependencies. For efficient means of data processing the industry standard SQL permits partial data and duplicate rows of data to occur in database systems. Consequently, the combined class of uniqueness constraints...
متن کاملNormalization of Relations with Nulls in Candidate Keys
This paper discusses normalization of relations when the candidate keys of a relation have missing information represented by nulls. The paper shows that when the missing information is of the type " not applicable " or " does not exist, " problems and confusion can arise in normalizing relations. Candidate keys with missing information commonly are found in relations that represent information...
متن کاملNormalization of Relations with Nulls in Candidate Keys: Traditional and Domain Key Normal Forms
This chapter discusses normalization of relations when the candidate keys of a relation have missing information represented by nulls. The chapter shows that problems and confusion can arise in normalizing relations with nulls in candidate keys. Candidate keys with missing information commonly are found in relations that represent information on two entities with a one-to-one relationship betwe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta Cybern.
دوره 16 شماره
صفحات -
تاریخ انتشار 2004